Set-systems with signed solutions
نویسندگان
چکیده
منابع مشابه
NEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS
We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...
متن کاملSigned Domination in Regular Graphs and Set-Systems
Suppose G is a graph on n vertices with minimum degree r. Using standard random methods it is shown that there exists a two-coloring of the vertices of G with colors, +1 and −1, such that all closed neighborhoods contain more 1’s than −1’s, and altogether the number of 1’s does not exceed the number of −1’s by more than (4 p log r/r + 1/r)n. For large r this greatly improves earlier results and...
متن کاملnew models and algorithms for solutions of single-signed fully fuzzy lr linear systems
we present a model and propose an approach to compute an approximate solution of fully fuzzy linear system $(ffls)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. first, in discussing an $ffls$ with a nonnegative coefficient matrix, we consider an equivalent $ffls$ by using an appropriate permutation to simplify fuzzy multiplications. t...
متن کاملDigitally Signed Documents – Ambiguities and Solutions
Digitally signing a digital document is a straightforward procedure; however, when the digital document contains dynamic content, the digital signature may remain valid but the viewed document may not be the same as the document when viewed by the signer. Other similar problems exist even with ‘static’ documents, if the appearance of a document can be changed. In this paper, we consider previou...
متن کاملErik Demaine Problem Set 6 Solutions Problem Set 6 Solutions
In the real-time strategy game Pluckmin 3, Captain Ottomar needs to move his troop of Pluckmin through hazardous terrain full of obstacles and predators. He has determined that when Pluckmin are traveling through predator-infested areas, there is a maximum number of Pluckmin that can safely travel along each edge without getting eaten. In addition to predators, some “lock” nodes have obstacles ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2003
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(02)00326-9